On regions and zones for event-clock automata
نویسندگان
چکیده
Event clock automata (ECA) are a model for timed languages that has been introduced by Alur, Fix and Henzinger as an alternative to timed automata, with better theoretical properties (for instance, ECA are determinizable while timed automata are not). In this paper, we revisit and extend the theory of ECA. We first prove that no finite time abstract language equivalence exists for ECA, thereby disproving a claim in the original work on ECA. This means in particular that regions do not form a time abstract bisimulation. Nevertheless, we show that regions can still be used to build a finite automaton recognizing the untimed language of an ECA. Then, we extend the classical notions of zones and DBMs to let them handle event clocks instead of plain clocks (as in timed automata) by introducing event zones and Event DBMs (EDBMs). We discuss algorithms to handle event zones represented as EDBMs, as well as (semi-) algorithms based on EDBMs to decide language emptiness of ECA. This work has been supported by the projects: (i) QUASIMODO (FP7ICT-STREP-214755), Quasimodo: “Quantitative System Properties in Model-Driven-Design of Embedded”, http://www.quasimodo. aau.dk/http://www.quasimodo.aau.dk/, (ii) GASICS (ESF-EUROCORES LogiCCC), Gasics: “Games for Analysis and Synthesis of Interactive Computational Systems”, http://www.ulb.ac.be/di/ gasics/http://www.ulb.ac.be/di/gasics/, (iii) Moves: “Fundamental Issues in Modelling, Verification and Evolution of Software”, http://moves.vub.ac.behttp://moves.vub.ac.be, a PAI program funded by the Federal Belgian Government and (iv) The European Union Seventh Framework Programme under Grant Agreement 601148 (Cassting), http://www.cassting-project.euhttp://www.cassting-project.eu. Gilles Geeraerts has been supported by a ‘Crédit aux chercheurs’ from the Belgian FRS/F.N.R.S. Gilles Geeraerts Université libre de Bruxelles, Faculté des Sciences, Département d’Informatique, Brussels, Belgium E-mail: [email protected] Jean-François Raskin Université libre de Bruxelles, Faculté des Sciences, Département d’Informatique, Brussels, Belgium E-mail: [email protected] Nathalie Sznajder Sorbonne Universités, Université Pierre et Marie Curie UMR CNRS 7606, LIP6, Paris, France E-mail: [email protected] 2 Gilles Geeraerts et al.
منابع مشابه
Event Clock Automata: From Theory to Practice
Event clock automata (ECA) are a model for timed languages that has been introduced by Alur, Fix and Henzinger as an alternative to timed automata, with better theoretical properties (for instance, ECA are determinizable while timed automata are not). In this paper, we revisit and extend the theory of ECA. We first prove that no finite time abstract language equivalence exists for ECA, thereby ...
متن کاملAdding Invariants to Event Zone Automata
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event occurrences instead of clock zones that use vectors of clock values grouped in polyhedral clock constraints. Symbolic state exploration with event zones rather than clock zones can result in significant reductions in t...
متن کاملTwo Novel D-Flip Flops with Level Triggered Reset in Quantum Dot Cellular Automata Technology
Quantum dot cellular automata (QCA) introduces a pioneer technology in nano scale computer architectures. Employing this technology is one of the solutions to decrease the size of circuits and reducing power dissipation. In this paper, two new optimized FlipFlops with reset input are proposed in quantum dot cellular automata technology. In addition, comparison with related works is performed.Th...
متن کاملDiscretization of Timed Automata in Timed μCRL à la Regions and Zones
We present the first step towards combining the best parts of the real-time verification methods based on timed automata (the use of regions and zones), and of the process-algebraic approach of languages like LOTOS and μCRL. μCRL targets the specification of system behavior in a process-algebraic (ACP) style and deals with data elements in the form of abstract data types. A timed automata speci...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Formal Methods in System Design
دوره 45 شماره
صفحات -
تاریخ انتشار 2014